Embedding Finite Lattices into Finite Biatomic Lattices

نویسندگان

  • Kira V. Adaricheva
  • Friedrich Wehrung
چکیده

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class of all finite lattices; — The class of all finite lower bounded lattices (solved by the first author’s earlier work). — The class of all finite join-semidistributive lattices (this problem was, until now, open). We solve the latter problem by finding a quasi-identity valid in all finite, atomistic, biatomic, join-semidistributive lattices but not in all finite join-semidistributive lattices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 2 Ja n 20 05 EMBEDDING FINITE LATTICES INTO FINITE BIATOMIC LATTICES

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class of all finite lattices; — The class of all finite lower bounded lattices (solved by the first author's earlier work). — The class of all finite join-semidistributive lattices (th...

متن کامل

FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES

The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...

متن کامل

Embedding Finite Lattices into the Computably Enumerable Degrees — a Status Survey

We survey the current status of an old open question in classical computability theory: Which finite lattices can be embedded into the degree structure of the computably enumerable degrees? Does the collection of embeddable finite lattices even form a computable set? Two recent papers by the second author show that for a large subclass of the finite lattices, the so-called join-semidistributive...

متن کامل

Cover preserving embedding of modular lattices into partition lattices

Wild, M., Cover preserving embedding of modular lattices into partition lattices, Discrete Mathematics 112 (1993) 207-244. When is a finite modular lattice couer preserving embeddable into a partition lattice? We give some necessary, and slightly sharper sufficient conditions. For example, the class of cover preserving embeddable modular lattices strictly contains the class of acyclic modular l...

متن کامل

A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees

We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Order

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2003